{\rtf1\ansi\ansicpg1252\cocoartf949\cocoasubrtf540
{\fonttbl\f0\fswiss\fcharset0 Helvetica;}
{\colortbl;\red255\green255\blue255;}
\paperw11900\paperh16840\margl1440\margr1440\vieww9000\viewh8400\viewkind0
\pard\tx566\tx1133\tx1700\tx2267\tx2834\tx3401\tx3968\tx4535\tx5102\tx5669\tx6236\tx6803\ql\qnatural\pardirnatural

\f0\fs24 \cf0 def prime_is(n):\
	return not[x for x in range(2,int(math.sqrt(n)+1)) if n%x==0]\
\
def primes_f(n):\
	t = 2\
	l = []\
	while t <= n:\
		if n%t == 0:\
			n /= t\
			l.append(t)\
		else: t+=1\
	return l\
\
def primes_f(n,t,l):\
	if n%t == 0: l.append(t); primes_f(n/t, t, l)\
	elif t<n+1: primes_f(n,t+1,l)\
	return l\
\
}